Strong functional pearl: Harper’s regular-expression matcher in Cedille
نویسندگان
چکیده
منابع مشابه
A Strong Regular Relation on ?-Semihyperrings
The concept of algebraic hyperstructures introduced by Marty as a generalization of ordinary algebraic structures. In an ordinary algebraic structure, the composition of two elements is an element, while in an algebraic hyperstructure, the composition of two elements is a set. The concept of ?-semihyperrings is a generalization of semirings, a generalization of semihyperrings and a generalizat...
متن کاملENP-Regex - a Regular Expression Matcher Prototype for the Expressive Notation Package
In this paper we introduce ENP-regex, a prototype of a regular expression matcher developed for Expressive Notation Package (ENP). ENP-regex allows us to use the regular expression syntax to match against several score attributes, such as pitch and rhythm. Instead of writing the regular expression matcher from scratch we implement a scheme where a thin conversion layer is inserted between an ex...
متن کاملA Dynamically Reconfigurable Pattern Matcher for Regular Expressions on FPGA
In this article we describe how to expand a partially dynamic reconfigurable pattern matcher for regular expressions presented in previous work by Divyasree and Rajashekar [2]. The resulting, extended, pattern matcher is fully dynamically reconfigurable. First, the design is adapted for use with parameterisable configurations, a method for Dynamic Circuit Specialization. Using parameterisable c...
متن کاملFUNCTIONAL PEARL InvertingtheBurrowsWheelertransform
The objective of this pearl is to derive the inverse of the Burrows-Wheeler transform from its specification, using simple equational reasoning. In fact, we derive the inverse of a more general version of the transform, proposed by Schindler.
متن کاملFUNCTIONAL PEARL Pickler Combinators
The tedium of writing pickling and unpickling functions by hand is relieved using a combinator library similar in spirit to the well-known parser combinators. Picklers for primitive types are combined to support tupling, alternation, recursion, and structure sharing. Code is presented in Haskell; an alternative implementation in ML is discussed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ACM on Programming Languages
سال: 2020
ISSN: 2475-1421
DOI: 10.1145/3409004